A Non-Iterative Procedure for Sparse Solutions to Linear Equations with Bandlimited Rows

نویسنده

  • Andrew E. Yagle
چکیده

The problem of computing sparse (mostly zero) solutions to underdetermined linear systems of equations has received much attention recently, due to its applications to compressed sensing. Under mild assumptions, the sparsest solution has minimum-L1norm, and can be computed using linear programming. We present a non-iterative algorithm for this problem that requires only that each row of the system matrix be bandlimited to the aspect ratio of the matrix. The algorithm can be used directly with lineartime-invariant sparsifying operators, and with wavelet transforms if the matrix is more bandlimited. A numerical example and code illustrate the algorithm. Keywords— Sparse reconstruction Phone: 734-763-9810. Fax: 734-763-1503. Email: [email protected]. EDICS: 2-REST.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation

Introduction Fractional differential equations (FDEs)  have  attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme  may be a good approach, particularly, the schemes in numerical linear algebra for solving ...

متن کامل

Summary of SuperLU

1 Overview of the Package SuperLU is a general-purpose library for the direct solution of large, sparse systems of linear equations on high performance machines. It is especially targeted for non-symmetric, non-definite systems. The library routines perform an LU factorization with numerical pivoting and triangular solutions through forward and back substitutions. The factorization can be appli...

متن کامل

Location of Non-Zeros in Sparse Solutions of Underdetermined Linear Systems of Equations

The problem of computing sparse (mostly zero) or sparsifiable (by linear transformation) solutions to greatly underdetermined linear systems of equations has applications in compressed sensing. The locations of the nonzero elements in the solution is a much smaller set of variables than the solution itself. We present explicit equations for the relatively few variables that determine these nonz...

متن کامل

A Non-Iterative Procedure for Computing Sparse and Sparsifiable Solutions to Slightly Underdetermined Linear Systems of Equations

The problem of computing sparse (mostly zero) solutions to underdetermined linear systems of equations has received much attention recently, due to its applications to compressed sensing. Under mild assumptions, the sparsest solution has minimum-L1norm, and can be computed using linear programming. In some applications (valid deconvolution, singular linear transformations), the linear system is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008